Behavioral Equivalence of Security-Oriented Interactive Systems
نویسندگان
چکیده
منابع مشابه
Formal Analysis of Security in Interactive Systems
Reducing the likelihood of human error in the use of interactive systems is increasingly important. Human errors could not only hinder the correct use and operation, they can also compromise the safety and security of such systems. Hence the need for formal methods to analyze and verify the correctness of interactive systems, particularly with regards to human interaction. This chapter examines...
متن کاملContext-Based Behavioral Equivalence of Components in Self-Adaptive Systems
An important challenge to realize dynamic adaptation is finding suitable components for substitution or interaction according to the current context. A possible solution is checking behavioral equivalence of components in different contexts. Two components are equivalent with respect to a context, if they behave equivalently in that context. In this work, we deal with context-specific behaviora...
متن کاملEquivalence of Convolution Systems in a Behavioral Framework
In this paper the problem of system equivalence is tackled for a rather general class of linear time-invariant systems. We consider AR-systems described by linear continuous shift-invariant operators with finite memory, acting on Frechet-signal spaces, containing the space £(lR) of infinitely differentiable functions on lR. This class is in one-one correspondence with matrices of suitable sizes...
متن کاملInformation Flow Security for Interactive Systems
The use of the Internet raises serious behavioural issues regarding, for example, security and the interaction among agents that may travel across links. Model-building such interactive systems is one of the biggest current challenges in computer science. A general model, action calculi, has been introduced by Robin Milner to unify the various emerging disciplines of interactive behaviour. In t...
متن کاملAutomating Security Analysis: Symbolic Equivalence of Constraint Systems
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity or strong secrecy). Infinite sets of possible traces are symbolically represented using deducibility constraints. We give a new algorithm that decides the trace equivalence for the traces that are represented using su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2016
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2015inp0017